Some considerations about Java implementation of two provably secure pseudorandom bit generators

The quest for a cryptographically secure pseudorandom bit generator (PRBG) was initiated long ago [13] [14], and for a long time the proposed pseudorandom generators were very slow [?]. (INSERIRLO IN BIBLIOGRAFIA). More recently some ”provably secure” PRBG capable to achieve a throughput rate greater than 1Mbit/sec has been proposed in [1] [2]. We noticed, anyway, the absence of Java implementations of such PRBGs, provably due to poor expected values for throughput rate. In the present paer we show that it is quite easy to write down Java implementations for them, achieving a throughput rae into range 0, 5 ÷ 7 Mbit/sec on very common mobile low-end devices. If moreover a modification we proposed in [3] is applied, the throughput rate is in the range 5 ÷ 80 Mbit/sec and can be clearly sufficient for many applications.